Algebraic Coding for Reliable Computation using Unreliable Gates
نویسنده
چکیده
We propose to study the algebraic coding problem in computing a logical-function through an unreliable logical gate-network, where unreliable means a small probability of failure at each logical-gate. We focus on suitable encoding of the input data to a probabilistic logic network such that the noisy output can be used to decode the actual output. This is very similar to the channel coding problem, except that general logic functions are much more complicated than an additive noise-channel. We note that these problems were proposed long ago, but a systematic algebraic coding strategy, except repetition, is unknown to the author.
منابع مشابه
On the maximum tolerable noise for reliable computation by formulas
It is shown that if formulas constructed from error-prone 3-input gates are used to compute Boolean functions, then a per-gate failure probability of 1/6 or more cannot be tolerated. The result is shown to be tight if the per-gate failure probability is constant and precisely known. Index Tenns -Computation by unreliable components, reliable com-
متن کاملAbstract for an Invited Paper for the MAR07 Meeting of The American Physical Society Architectural Design Issues for Reliable Trapped Ion Quantum Computers
for an Invited Paper for the MAR07 Meeting of The American Physical Society Architectural Design Issues for Reliable Trapped Ion Quantum Computers ISAAC CHUANG, MIT Central to the design of large-scale quantum computers is the fact that reliable quantum systems must explicitly and actively deal with relatively large component failure rates during operation. A quantum computing system must thus ...
متن کاملSynthesis and Complexity of Asymptotically Optimal Circuits with Unreliable Gates
We consider the realization of Boolean functions by combinatorial circuits with unreliable gates computing the functions from a full final basis B. We assume that all gates of the basis can have inverse faults on the outputs independently with probability ε (ε ∈ (0, 1/2)). We describe a set Mk (k ≥ 3) of Boolean functions, presence even by one of which in basis B guarantees the computing of alm...
متن کاملGeneration of Efficient Codes for Realizing Boolean Functions in Nanotechnologies
1. Abstract We address the challenge of implementing reliable computation of Boolean functions in future nanocircuit fabrics. Such fabrics are projected to have very high defect rates. We overcome this limitation by using a combination of cheap but unreliable nanodevices and reliable but expensive CMOS devices. In our approach, defect tolerance is achieved through a novel coding of Boolean func...
متن کاملGeneration of Efficient Codes for Realizing Boolean Functions in Nanotechnologies
1. Abstract We address the challenge of implementing reliable computation of Boolean functions in future nanocircuit fabrics. Such fabrics are projected to have very high defect rates. We overcome this limitation by using a combination of cheap but unreliable nanodevices and reliable but expensive CMOS devices. In our approach, defect tolerance is achieved through a novel coding of Boolean func...
متن کامل